Existential monadic second order logic of undirected graphs: The Le Bars conjecture is false

In 2001, J.-M. Le Bars disproved the zero-one law (that says that every sentence from a certain logic is either true asymptotically almost surely (a.a.s.), or false a.a.s.) for existential monadic second order sentences (EMSO) on undirected graphs. He proved that there exists an EMSO sentence ? such that $\mathsf{P}(G_n??)$ does not converge as $n\to \infty$ (here, the probability distribution is uniform over the set of all graphs on the labeled set of vertices $\{1,\dots ,n\}$). In the same paper, he conjectured that, for EMSO sentences with 2 first order variables, the zero-one law holds. In this paper, we disprove this conjecture.     

Some unsolvable conjectures in finite p-groups

We survey some unsolvable conjectures in finite p-groups and their research progress.     

Vertex-disjoint cycles in local tournaments

Let $r$ be a positive integer. The Bermond–Thomassen conjecture states that, a digraph of minimum out-degree at least $2r-1$ contains $r$ vertex-disjoint directed cycles. A digraph $D$ is called a local tournament if for every vertex $x$ of $D$, both the out-neighbours and the in-neighbours of $x$ induce tournaments. Note that tournaments form the subclass of local tournaments. In this paper, we verify that the Bermond–Thomassen conjecture holds for local tournaments. In particular, we prove that every local tournament $D$ with ${\delta }^{+}\left(D\right)\ge 2r-1$ contains $r$ disjoint cycles $C_1,C_2,\dots ,C_r$, satisfying that either $C_i$ has the length at most 4 or is a shortest cycle of the original digraph of $D-C_1-\dots -C_{i-1}$ for $1\le i\le r$.     

交错群A_5与二面体群D_6直积的整群环的挠单位

本文利用Luthar-Passi方法,研究了五次交错群A_5与六阶二面体群D_6直积的整群环的挠单位,得到了该群的Zassenhaus猜想成立.     

Nowhere‐Zero 5‐Flows On Cubic Graphs with Oddness 4

Tutte's 5‐flow conjecture from 1954 states that every bridgeless graph has a nowhere‐zero 5‐flow. It suffices to prove the conjecture for cyclically 6‐edge‐connected cubic graphs. We prove that every cyclically 6‐edge‐connected cubic graph with oddness at most 4 has a nowhere‐zero 5‐flow. This implies that every minimum counterexample to the 5‐flow conjecture has oddness at least 6.     

On the Auslander–Reiten conjecture for Cohen–Macaulay rings and path algebras

In this note, it is shown that the validity of the Auslander–Reiten conjecture for a given d-dimensional Cohen–Macaulay local ring R depends on its validity for all direct summands of d-th syzygy of R-modules of finite length, provided R is an isolated singularity. Based on this result, it is shown that under a mild assumption on the base ring R, satisfying the Auslander–Reiten conjecture behaves well under completion and reduction modulo regular elements. In addition, it will turn out that, if R is a commutative Noetherian ring and 𝒬 a finite acyclic quiver, then the Auslander–Reiten conjecture holds true for the path algebra R𝒬, whenever so does R. Using this result, examples of algebras satisfying the Auslander–Reiten conjecture are presented.     

Hochster’s small MCM conjecture for three-dimensional weakly F-split rings

We prove Hochster’s small maximal Cohen–Macaulay conjecture for three-dimensional complete F-pure rings. We deduce this from a more general criterion, and show that only a weakening of the notion of F-purity is needed, to wit, being weakly F-split. We conjecture that any complete ring is weakly F-split.